Perfect matchings in 3-partite 3-uniform hypergraphs
نویسندگان
چکیده
منابع مشابه
Perfect matchings in 3-partite 3-uniform hypergraphs
Let H be a 3-partite 3-uniform hypergraph with each partition class of size n, that is, a 3-uniform hypergraph such that every edge intersects every partition class in exactly one vertex. We determine the Dirac-type vertex degree thresholds for perfect matchings in 3-partite 3-uniform hypergraphs.
متن کاملVertex Degree Sums for Perfect Matchings in 3-uniform Hypergraphs
We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in a 3-graph without isolated vertex. More precisely, suppose that H is a 3-uniform hypergraph whose order n is sufficiently large and divisible by 3. If H contains no isolated vertex and deg(u)+deg(v) > 2 3 n2− 8 3 n+2 for any two vertices u and v that are contained in some edge of H, then H contains a...
متن کاملMatchings in 3-uniform hypergraphs
We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph. More precisely, suppose thatH is a sufficiently large 3-uniform hypergraph whose order n is divisible by 3. If the minimum vertex degree of H is greater than ( n−1 2 )
متن کاملConnected Components of 3-Partite 3-Uniform Hypergraphs
Social bookmarking sites allow users to organize resources like URLs, bibliographic references or media files using “tags”, arbitrary keywords that can be used later on to retrieve those resources. As many users (millions, on the most popular sites) perform such tagging in parallel, this leads to a rich, collaborative description of the tagged resources[2]. The resulting data can be interpreted...
متن کاملPerfect matchings in random uniform hypergraphs
In the random k-uniform hypergraph Hk(n, p) on a vertex set V of size n, each subset of size k of V independently belongs to it with probability p. Motivated by a theorem of Erdős and Rényi [6] regarding when a random graph G(n, p) = H2(n, p) has a perfect matching, Schmidt and Shamir [14] essentially conjectured the following. Conjecture Let k|n for fixed k ≥ 3, and the expected degree d(n, p)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2014
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2014.05.004